A New Two-phase Hybrid Metaheuristic for Vehicle Routing Problem with Time Windows
نویسندگان
چکیده
This paper proposes a new two-phase hybrid metaheuristic for vehicle routing problem with time windows (VRPTW). The first phase is to minimize the number of routes by means of variable neighborhood search algorithm, while the second phase is mainly aimed at minimizing the total travel distance using tabu search algorithm. Three neighborhood search operators (All-exchange, All-2-opt, All-crossexchange) and two local serarch operators (All-relocate and ejection chain) are designed. To further lower the number of vehicles, the sum-of-squares route sizes is maximized in the first phase. A comparative test is implemented by our algorithm on the basis of 56 benchmark problems proposed by Solomon (1987), the mean number of vehicles and running time of this algorithm is very competitive comparing to previous metaheuristics, showing that the new two-phase hybrid metaheuristic is effective and fast.
منابع مشابه
Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
متن کاملSolving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کامل